One-way multiparty communication lower bound for pointer jumping with applications
نویسندگان
چکیده
منابع مشابه
Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connections to many aspects of complexity theory, has seen a recent burst of research activity, seemingly preparing the ground for an Ω(n) lower bound, for constant k. Our first result is a surprising sublinear — i.e., o(n) ...
متن کاملNOF-Multiparty Information Complexity Bounds for Pointer Jumping
We prove a lower bound on the communication complexity of pointer jumping for multiparty one-way protocols in the number on the forehead model that satisfy a certain information theoretical restriction: We consider protocols for which the ith player may only reveal information about the first i+1 inputs. To this end we extend the information complexity approach of Chakrabarti, Shi, Wirth, and Y...
متن کاملOn the Power of Lower Bound Methods for One-Way Quantum Communication Complexity
This paper studies the three known lower bound methods for one-way quantum communication complexity, namely the Partition Tree method by Nayak, the Trace Distance method by Aaronson, and the two-way quantum communication complexity. It is shown that all these three methods can be exponentially weak for some total Boolean functions. In particular, for a large class of functions generated from Er...
متن کاملLower bounds on communication for multiparty computation
The present report contains a proof of a linear lower bound for a typical three-party secure computation scheme of n independent AND functions. The goal is to prove some linear communication lower bound for a maximally broad definition of «typical». The article [1] contains various communications lower bounds for unconditionally secure multiparty computation. In particular, it contains a linear...
متن کاملLower Bounds for One-way Probabilistic Communication Complexity
We prove three diierent types of complexity lower bounds for the one-way unbounded-error and bounded-error error probabilistic communication protocols for boolean functions. The lower bounds are proved in terms of the deterministic communication complexity of functions and in terms of the notion \probabilistic communication characteristic" that we deene. We present boolean functions with the di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2009
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-009-2667-z